Finite Moments of Workload Components in FIFO Multiserver Queues
نویسندگان
چکیده
Previously established necessary and sufficient conditions for finite stationary moments in stable FIFO GI/GI/s queues exist only for the first component of the workload vector, the delay. In this paper, we derive moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues. As in the case of stationary delay, the moment conditions for workload components incorporate the interaction between service time distribution, traffic intensity and the number of servers in the queue. If we denote a generic service time random variable by S, a generic interarrival time by T , and define the traffic intensity as ρ = ES/ET , then sufficient conditions so that EWi < ∞, where Wi is the i’th smallest component of the ordered workload vector, depend crucially on the traffic intensity relative to i — specifically, on whether i ≤ dρe or i > dρe, where for any real x, dxe denotes the smallest interger greater than or equal to x. Explicitly, for i ≤ dρe, EW i < ∞, provided that ES1 < ∞, where β1(i) = (s− bρc+ α)/(s− bρc), for α ≥ 1. Furthermore, components with indices lower than dρe all share the same finite moment conditions. This is not true for i > dρe; these components have individual finite moment conditions: EW i < ∞ provided that ES2 < ∞, where β2(i) = (s − i+ α)/(s − i), for α ≥ 1. Finally, for S in the class L βj(i) 1 , j = 1, 2, defined in [9], these conditions are also necessary.
منابع مشابه
Sink or swim together: necessary and sufficient conditions for finite moments of workload components in FIFO multiserver queues
Previously established necessary and sufficient conditions for finite stationary moments in stable FIFO GI/GI/s queues exist only for the first component of the workload vector, the delay. In this paper, we derive moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues. As in the case of stationary delay, the moment conditions for workload component...
متن کاملFurther delay moment results for FIFO multiserver queues
Using a new family of service disciplines, we provide weaker su cient conditions for nite stationary delay moments in FIFO multiserver queues. This extends the work in Sigman and Scheller-Wolf[1997] to GI=GI=s queues with = E[S]=E[T ] < s 1, where S and T are generic service and interarrival times, respectively. Thus, only when > s 1 are the familiar Kie er and Wolfowitz conditions actually nec...
متن کاملPerformance, Scalability, and Semantics of Concurrent FIFO Queues
We introduce the notion of a k-FIFO queue which may dequeue elements out of FIFO order up to a constant k ≥ 0. Retrieving the oldest element from the queue may require up to k+ 1 dequeue operations (bounded fairness), which may return elements not younger than the k + 1 oldest elements in the queue (bounded age) or nothing even if there are elements in the queue. A k-FIFO queue is starvation-fr...
متن کاملAnalytic study of multiplexing effects in two-class queues with correlations
An improved (i.e., reduced) quasi-birth-death representation of a FIFO queue with two separate traffic streams (and dedicated service processes) is combined with ETAQA truncation to yield scalable finite approximations of the two departure processes from this queue. Via matrix-analytic techniques, these models may be used to study various arrival/service interdependences between the two traffic...
متن کاملFast and Scalable k-FIFO Queues
We introduce fast and scalable algorithms that implement boundedand unbounded-size, lock-free, linearizable k-FIFO queues with empty (and full) check. Logically, a k-FIFO queue can be understood as queue where each element may be dequeued out-of-order up to k− 1 or as pool where each element is dequeued within a k-bounded number of dequeue operations. We show experimentally that there exist opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015